Factoring 512-bit RSA Moduli for Fun (and a Profit of $9,000)
نویسندگان
چکیده
The recent FREAK attack highlighted widespread support for export-grade RSA keys in TLS servers. We present the results of an IPv4-wide survey of TLS servers performed roughly one week after FREAK was announced. We found that only 9.7% of servers now support such export-grade RSA keys. However, we also found that some keys are repeated with high frequency, making each of them an attractive target for a direct factoring attack; one key in particular was repeated 28,394 times. We also computed the pairwise gcds of all the export-grade RSA moduli that we found, leading to 90 factorisations. These moduli correspond to 294 different hosts. The computation took less than 3 minutes on an 8-core system, saving the $9,000 that a cloud computation would have cost if each modulus had been attacked directly. We consider this to be a good return on investment for a Friday afternoon’s work.
منابع مشابه
Improved Factoring of RSA Modulus
In 1999, the 512-bit number of 155 digits taken from the RSA Challenge list was first factored by the General Number Field Sieve. This work was done on a supercomputer and about 300 PCs or workstations by 17 experts all over the world. The calendar time for the factorization was over 6 months. Based on the open source GGNFS, we improved its algorithms and implementations. Now the 512-bit RSA mo...
متن کامل1 Factorization of a 512 { bit RSA Modulus
On August 22, 1999, we completed the factorization of the 512{bit 155{digit number RSA{155 with the help of the Number Field Sieve factoring method (NFS). This is a new record for factoring general numbers. Moreover, 512{bit RSA keys are frequently used for the protection of electronic commerce|at least outside the USA|so this factorization represents a breakthrough in research on RSA{based sys...
متن کاملNotes in Computer Science 2729
The security of the RSA cryptosystem depends on the difficulty of factoring large integers. The best current factoring algorithm is the Number Field Sieve (NFS), and its most difficult part is the sieving step. In 1999 a large distributed computation involving hundreds of workstations working for many months managed to factor a 512-bit RSA key, but 1024-bit keys were believed to be safe for the...
متن کاملFactoring as a Service
The difficulty of integer factorization is fundamental to modern cryptographic security using RSA encryption and signatures. Although a 512-bit RSA modulus was first factored in 1999, 512-bit RSA remains surprisingly common in practice across many cryptographic protocols. Popular understanding of the difficulty of 512-bit factorization does not seem to have kept pace with developments in comput...
متن کاملFactoring Large Numbers with the TWIRL Device
The security of the RSA cryptosystem depends on the difficulty of factoring large integers. The best current factoring algorithm is the Number Field Sieve (NFS), and its most difficult part is the sieving step. In 1999 a large distributed computation involving hundreds of workstations working for many months managed to factor a 512-bit RSA key, but 1024-bit keys were believed to be safe for the...
متن کامل